Multilevel transitive and intransitive non-interference, causally
نویسندگان
چکیده
منابع مشابه
Intransitive Non-Interference by Unfolding
Non-interference characterizes the absence of undesired information flows in a computing system, by requiring that activities involving actions with higher level of confidentiality does not cause any observable effect at the lower level. Recently, a causal characterisation of non-interference on Petri nets has been given in terms of the unfolding semantics, a classical true concurrent semantics...
متن کاملIntransitive Non-Interference for Cryptographic Purposes
specification of what the system should do, possible implementations have to be proven to be at least as secure as this specification. The abstract specification usually consists of a monolithic idealized machine containing neither cryptographic details nor probabilism. Thus, its properties can typically be validated quite easily by formal proof systems, e.g., formal theorem proving or even aut...
متن کاملOpacity with Orwellian Observers and Intransitive Non-Interference
Opacity is a general behavioural security scheme flexible enough to account for several specific properties. Some secret set of behaviors of a system is opaque if a passive attacker can never tell whether the observed behavior is a secret one or not. Instead of considering the case of static observability where the set of observable events is fixed off-line or dynamic observability where the se...
متن کاملAF verbs: transitive, intransitive, or both
As far as the transitivity of AF verbs is concerned, there are two conflicting hypotheses in the Austronesian literature. In the ergative hypothesis (Starosta 1997), AF verbs are uniformly identified as antipassive/intransitive; in the symmetrical-voice hypothesis (Kroeger 1993), AF verbs are claimed to be able to occur as transitive on a par with NAF verbs. In this paper, we address the issue ...
متن کاملOn Intransitive Non-interference in Some Models of Concurrency
Intransitive non-interference (INI for short) is a behavioural property extensively studied by Rushby over deterministic automata with outputs associated to transitions (Mealy machines) in order to discuss security of systems where declassification of secret information is allowed. In this paper, we first propose a natural transposition of Rushby’s definition on deterministic labelled transitio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2018
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2017.10.004